Words and forbidden factors
نویسندگان
چکیده
منابع مشابه
Words and forbidden factors
Given a *nite or in*nite word v, we consider the set M (v) of minimal forbidden factors of v. We show that the set M (v) is of fundamental importance in determining the structure of the word v. In the case of a *nite word w we consider two parameters that are related to the size of M (w): the *rst counts the minimal forbidden factors of w and the second gives the length of the longest minimal f...
متن کاملMinimal Forbidden Factors of Circular Words
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al. [IPL, 1998] gave an algor...
متن کاملAutomata and Forbidden Words
Let L(M) be the (factorial) language avoiding a given anti-factorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eeective if M is nite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm ...
متن کاملForbidden Words in Symbolic Dynamics
We introduce an equivalence relation between functions from to . By describing a symbolic dynamical system in terms of forbidden words, we prove that the -equivalence class of the function that counts the minimal forbidden words of a system is a topological invariant of the system. We show that the new invariant is independent from previous ones, but it is not characteristic. In the case of sof...
متن کاملMinimal Forbidden Words and Factor Automata
Let L(M) be the (factorial) language avoiding a given anti-factorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eeective if M is nite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00436-9